Minimal polynomial dynamics on the set of 3-adic integers
نویسندگان
چکیده
In this paper are characterized the polynomials, in terms of their coefficients, that have all their orbits dense in the set of 3-adic integers Z3.
منابع مشابه
Complexity of regular invertible p-adic motions.
We consider issues of computational complexity that arise in the study of quasi-periodic motions (Siegel discs) over the p-adic integers, where p is a prime number. These systems generate regular invertible dynamics over the integers modulo p(k), for all k, and the main questions concern the computation of periods and orbit structure. For a specific family of polynomial maps, we identify condit...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملOn the Key Equation Over a Commutative Ring
We define alternant codes over a commutative ring R and a corresponding key equation. We show that when the ring is a domain, e.g. the p-adic integers, the error–locator polynomial is the unique monic minimal polynomial (shortest linear recurrence) of the syndrome sequence and that it can be obtained by Algorithm MR of Norton. When R is a local ring, we show that the syndrome sequence may have ...
متن کاملSome Identities on the q-Euler Numbers with Weak Weight α and Bernstein Polynomials
In this paper we investigate some relations between Bernstein polynomials and q-Euler numbers with weak weight α. From these relations, we derive some interesting identities on the q-Euler numbers with weak weight α. Let p be a fixed odd prime number. Throughout this paper, we always make use of the following notations: Z denotes the ring of rational integers, Zp denotes the ring of p-adic rati...
متن کاملModular and p-adic Cyclic Codes
This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo pa and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic cyclic code of length 7 with generator polynomial X 3 + ,~X 2 + (L I)X -l, where )~ satisfies ~2 _ k + 2 = 0. This is the 2-adic generalization of both the bina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008